Rank Selection in Nonnegative Matrix Factorization using Minimum Description Length
نویسندگان
چکیده
منابع مشابه
A MDL4BMF: Minimum Description Length for Boolean Matrix Factorization
s 859 3 933 1.2 – 168 19 DBLP 6 980 19 13.0 19 15 4 Dialect 1 334 506 16.1 389 56 37 DNA Amp. 4 590 392 1.5 365 39 54 Mammals 2 183 124 20.5 122 50 13 Mushroom 8 192 112 19.3 112 175 59 Newsgroups 400 800 3.5 398 17 17 NSF Abstracts 12 841 4 894 0.9 – 1835 2098 Paleo 501 139 5.1 46 96 19 Newsgroups is a subset of the well-known 20Newsgroups dataset,7 containing, for 400 posts from 4 newsgroups8...
متن کاملOn Reduced Rank Nonnegative Matrix Factorization for Symmetric Nonnegative Matrices
Let V ∈ R be a nonnegative matrix. The nonnegative matrix factorization (NNMF) problem consists of finding nonnegative matrix factors W ∈ R and H ∈ R such that V ≈ WH. Lee and Seung proposed two algorithms which find nonnegative W and H such that ‖V −WH‖F is minimized. After examining the case in which r = 1 about which a complete characterization of the solution is possible, we consider the ca...
متن کاملAutomatic Rank Determination in Projective Nonnegative Matrix Factorization
Projective Nonnegative Matrix Factorization (PNMF) has demonstrated advantages in both sparse feature extraction and clustering. However, PNMF requires users to specify the column rank of the approximative projection matrix, the value of which is unknown beforehand. In this paper, we propose a method called ARDPNMF to automatically determine the column rank in PNMF. Our method is based on autom...
متن کاملFast Nonnegative Matrix Factorization with Rank-one ADMM
Nonnegative matrix factorization (NMF), which aims to approximate a data matrix with two nonnegative low rank matrix factors, is a popular dimensionality reduction and clustering technique. Due to the non-convex formulation and the nonnegativity constraints over the two low rank matrix factors (with rank r > 0), it is often difficult to solve NMF efficiently and accurately. Recently, the altern...
متن کاملHierarchical community detection via rank-2 symmetric nonnegative matrix factorization
Background Community discovery is an important task for revealing structures in large networks. The massive size of contemporary social networks poses a tremendous challenge to the scalability of traditional graph clustering algorithms and the evaluation of discovered communities. Methods We propose a divide-and-conquer strategy to discover hierarchical community structure, nonoverlapping wit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Neural Computation
سال: 2017
ISSN: 0899-7667,1530-888X
DOI: 10.1162/neco_a_00980